A polyhedral study of the semi-continuous knapsack problem
نویسندگان
چکیده
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack problem arises in a number of other contexts, e.g. it is a relaxation of general mixed-integer programming. We show how strong inequalities valid for the semi-continuous knapsack polyhedron can be derived and used in a branch-and-cut scheme for problems with semi-continuous variables. To demonstrate the effectiveness of these inequalities, which we call collectively semi-continuous cuts, we present computational results on real instances of the unit commitment problem.
منابع مشابه
A Polyhedral Study of the Cardinality Constrained Knapsack Problem
A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas as finance, location, and scheduling. Traditionally, cardinality constraints are modeled by introducing auxiliary 0-1 variables and additional constraints that relate the continuous ...
متن کاملSemi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack problem is a relaxation of general mixed-integer programming. We show how strong inequalities valid for the semi-continuous knapsack polyhedron can be derived and used in a branch...
متن کاملThe 0-1 Knapsack problem with a single continuous variable
Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints. Here we study such constraint sets, and derive valid inequalities that can be used as cuts for such sets, as well for more general mixed 0-1 constraints. Specifically we investigate the polyhedral structure ...
متن کاملFacets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use an alternative approach, in which we keep in the model only the continuous variables, and we tighten th...
متن کاملA note on polyhedral aspects of a robust knapsack problem
The robust optimization framework proposed by Bertsimas and Sim can take account of data uncertainty in linear programs. The current paper investigates the polyhedral impacts of this robust model for the 0-1 knapsack problem. In particular, classical cover cuts are adapted to provide valid inequalities for the robust knapsack problem. The strength of the proposed inequalities is highlighted fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 142 شماره
صفحات -
تاریخ انتشار 2013